Comments on "Next-State Equations of Asynchronous Sequential Machines"

نویسندگان

  • Gary K. Maki
  • Dwight H. Sawin
چکیده

In this correspondence a newcombinational algorithmfor the covering problems is proposed andcomputational experimentsareanalyzed.This algorithm enables one todetermine a set of covers associatedwith the paths of adirected rooted tree that contains atleast a mini-mal cover.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

On Fault Diagnosis of Asynchronous Sequential Machines with Parallel Composition

Fault diagnosis of composite asynchronous sequential machines with parallel composition is addressed in this paper. An adversarial input can infiltrate one of two submachines comprising the composite asynchronous machine, causing an unauthorized state transition. The objective is to characterize the condition under which the controller can diagnose any fault occurrence. Two control configuratio...

متن کامل

Counteracting the Effects of Adversarial Inputs on Asynchronous Sequential Machines

The problem of counteracting the effects of adversarial inputs on the operation of an asynchronous sequential machine is considered. The objective is to build an automatic state-feedback controller that returns an asynchronous sequential machine to its original state, after the machine has undergone a state transition caused by an adversarial input. It is shown that the existence of such a cont...

متن کامل

Conditions for Model Matching of Switched Asynchronous Sequential Machines with Output Feedback

Solvability of the model matching problem for input/output switched asynchronous sequential machines is discussed in this paper. The control objective is to determine the existence condition and design algorithm for a corrective controller that can match the stable-state behavior of the closed-loop system to that of a reference model. Switching operations and correction procedures are incorpora...

متن کامل

Synthesis-for-Initializability of Asynchronous Sequential Machines

We present a new method for the synthesis-forinitializability of asynchronous state machines. Unlike existing approaches, our method incorporates a state assignment step. State assignment is critical, since initializability may be precluded by poor choice of state assignment. Also, we present precise conditions on hazard-free logic, to insure that the circuits are physically initializable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 22  شماره 

صفحات  -

تاریخ انتشار 1973